A Feature Structure Algebra for FTAG
نویسنده
چکیده
FTAG, the extension of TAG with feature structures, lags behind other featurebased grammar formalisms in the availability of efficient chart parsers. This is in part because of the complex interaction of adjunction and unification, which makes such parsers inconvenient to implement. We present a novel, simple algebra for feature structures and show how FTAG can be encoded as an Interpreted Regular Tree Grammar using this algebra. This yields a straightforward, efficient chart parsing algorithm for FTAG.
منابع مشابه
RTG based surface realisation for TAG
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based Tree Adjoining Grammar (FTAG) which draws on the observation that an FTAG can be translated into a Regular Tree Grammar describing its derivation trees. We carry out an extensive testing of several variants of this algo...
متن کاملUsing regular tree grammars to enhance sentence realisation
Feature-based regular tree grammars (FRTG) can be used to generate the derivation trees of a featurebased tree adjoining grammar (FTAG). We make use of this fact to specify and implement both an FTAG-based sentence realiser and a benchmark generator for this realiser. We argue furthermore that the FRTG encoding enables us to improve on other proposals based on a grammar of TAG derivation trees ...
متن کاملTree Adjoining Grammar, Semantic Calculi and Labelling Invariants
Recently, proposals have been made to combine Tree Adjoining Grammar (TAG) with either Glue or Flat Semantic Representation Languages. In this paper, we additionally specify the combination of TAG with λ-based semantics and compare the three approaches. We observe several invariants and suggest that semantic construction in TAG is governed by a set of general principles that can be used to faci...
متن کاملUsing Descriptions of Trees in a Tree Adjoining Grammar
This paper describes a new interpretation of Tree Adjoining Grammars (TAG) that allows the embedding of TAG in the unification framework in a manner consistent with the declarative approach taken in this framework. In the new interpretation we present in this paper, the objects manipulated by a TAG are considered to be descriptions of trees. This is in contrast to the traditional view that in a...
متن کاملA Novel Replication Technique for Implementing Fault-Tolerant Parallel Software
In this paper we present a novel replication technique based on the FTAG computation model. FTAG is a functional and attribute based language for programming fault-tolerant parallel applications [4]. FTAG have a tree structure computation model. In the replication technique developed an application is replicated on di erent group of processors. Each group is called a replica. All replicas are a...
متن کامل